Kernel structure of block Hankel and Toeplitz matrices and partial realization
نویسندگان
چکیده
منابع مشابه
The Inverses of Block Hankel and Block Toeplitz Matrices
A set of new formulae for the inverse of a block Hankel (or block Toeplitz) matrix is given. The formulae are expressed in terms of certain matrix Pad6 forms, which approximate a matrix power series associated with the block Hankel matrix. By using Frobenius-type identities between certain matrix Pad6 forms, the inversion formulae are shown to generalize the formulae of Gohberg-Heinig and, in t...
متن کاملIrreducible Toeplitz and Hankel matrices
An infinite matrix is called irreducible if its directed graph is strongly connected. It is proved that an infinite Toeplitz matrix is irreducible if and only if almost every finite leading submatrix is irreducible. An infinite Hankel matrix may be irreducible even if all its finite leading submatrices are reducible. Irreducibility results are also obtained in the finite cases.
متن کاملKronecker product approximations for dense block Toeplitz-plus-Hankel matrices
In this paper, we consider the approximation of dense block Toeplitz-plus-Hankel matrices by sums of Kronecker products. We present an algorithm for efficiently computing the matrix approximation that requires the factorization of matrices of much smaller dimension than that of the original. The main results are described for block Toeplitz matrices with Toeplitz-plus-Hankel blocks (BTTHB), but...
متن کاملBalanced Random Toeplitz and Hankel Matrices
Except for the Toeplitz and Hankel matrices, the common patterned matrices for which the limiting spectral distribution (LSD) are known to exist share a common property–the number of times each random variable appears in the matrix is (more or less) the same across the variables. Thus it seems natural to ask what happens to the spectrum of the Toeplitz and Hankel matrices when each entry is sca...
متن کاملFast Algorithms for Toeplitz and Hankel Matrices
The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90299-p